CSC in concurrent languages prototyping
نویسندگان
چکیده
In [11] we presented a compositional interpreter for a CSP-like language and we showed that, by using the ”continuation semantics for concurrency” (CSC) technique (recently introduced by us), denotational semantics can be used as a prototyping method for concurrent programming languages. In this paper we employ domains (which are complete partial orders) and continuous functions in developing a denotational semantics which is a mathematical formalization of the compositional interpreter given in [11].
منابع مشابه
Continuations for Prototyping Concurrent Languages
We have recently introduced the “continuation semantics for concurrency” (CSC) technique in an attempt to exploit the benefits of using continuations in concurrent systems development. In the CSC approach, a continuation is an application-dependent configuration of computations (partially evaluated denotations). Every computation or group of computations contained in a continuation can be acces...
متن کاملContinuations for Remote Objects Control
We have recently introduced the ”continuation semantics for concurrency” (CSC) technique in an attempt to exploit the benefits of using continuations in concurrent systems development. CSC is a general technique for denotational semantics which provides excellent flexibility in the compositional modeling of concurrent control concepts. In this paper, we present a denotational semantics designed...
متن کاملPrototyping Programming Environments for Object-Oriented Concurrent Languages: a Smalltalk-Based Experience Lo c LESCAUDRON
This paper discusses the prototyping of programming environments for object-oriented concurrent programming languages. We advocate designing new prototypes starting from existing sophisticated programming environments that we can nd in standard (sequential) object-oriented programming languages (namely Smalltalk-80 1 ). Our starting point is a testbed for object-oriented concurrent languages ba...
متن کاملImplementing a Finite Domain Constraint Solving System in KLIC
The paper presents CHUKL, a parallel nite-domain constraint solving system. The implementation is written in the concurrent logic programming language KL1, instead of C. The work challenges the assumption that committed choice concurrent logic programming languages cannot deal with don't know non-determinism. A dynamic forking scheme is designed and implemented to handle choicepoint making. The...
متن کاملLogic-Based Specification Languages for Intelligent Software Agents
The research field of Agent-Oriented Software Engineering (AOSE) aims to find abstractions, languages, methodologies and toolkits for modeling, verifying, validating and prototyping complex applications conceptualized as Multiagent Systems (MASs). A very lively research sub-field studies how formal methods can be used for AOSE. This paper presents a detailed survey of six logic-based executable...
متن کامل